Tight bounds on the infinity norm of inverses of symmetric diagonally dominant positive matrices
نویسندگان
چکیده
We prove tight bounds for the ∞-norm of the inverse of symmetric diagonally dominant positive matrices. Applications include numerical stability for linear systems, bounds on inverses of differentiable functions, and the consistency of maximum entropy graph distributions from single samples.
منابع مشابه
Inverses of symmetric, diagonally dominant positive matrices and applications
We prove tight bounds for the ∞-norm of the inverse of a symmetric, diagonally dominant positive matrix J ; in particular, we show that ‖J‖∞ is uniquely maximized among all such J . We also prove a new lower-bound form of Hadamard’s inequality for the determinant of diagonally dominant positive matrices and an improved upper bound for diagonally balanced positive matrices. Applications of our r...
متن کاملThe infinity norm bound for the inverse of nonsingular diagonal dominant matrices
In this note, we bound the inverse of nonsingular diagonal dominant matrices under the infinity norm. This bound is always sharper than the one in [P.N. Shivakumar, et al., On two-sided bounds related to weakly diagonally dominant M-matrices with application to digital dynamics, SIAM J. Matrix Anal. Appl. 17 (2) (1996) 298–312]. c © 2008 Published by Elsevier Ltd
متن کاملTwo side bounds on the inverses of diagonally dominant tridiagonal matrices
We establish upper and lower bounds for the entries of the inverses of diagonally dominant tridiagonal matrices. These bounds improve the bounds recently given by Shivakumar and Ji. Moreover, we show how to improve our bounds iteratively. For an n n M{matrix this iterative reenement yields the exact inverse after n ? 1 steps.
متن کاملPerturbation bounds for $g$-inverses with respect to the unitarily invariant norm
Let complex matrices $A$ and $B$ have the same sizes. Using the singular value decomposition, we characterize the $g$-inverse $B^{(1)}$ of $B$ such that the distance between a given $g$-inverse of $A$ and the set of all $g$-inverses of the matrix $B$ reaches minimum under the unitarily invariant norm. With this result, we derive additive and multiplicative perturbation bounds of the nearest per...
متن کاملOn Factor Width and Symmetric H-matrices
We define a matrix concept we call factor width. This gives a hierarchy of matrix classes for symmetric positive semidefinite matrices, or a set of nested cones. We prove that the set of symmetric matrices with factor width at most two is exactly the class of (possibly singular) symmetric H-matrices (also known as generalized diagonally dominant matrices) with positive diagonals, H+. We prove b...
متن کامل